A K-trivial set which is not jump traceable at certain orders
نویسنده
چکیده
We construct a K-trivial c.e. set which is not jump traceable at any order in o(log x).
منابع مشابه
Reals which Compute Little André
We investigate combinatorial lowness properties of sets of natural numbers (reals). The real A is super-low if A′ ≤tt ∅′, and A is jump-traceable if the values of {e}A(e) can be effectively approximated in a sense to be specified. We investigate those properties, in particular showing that super-lowness and jump-traceability coincide within the r.e. sets but none of the properties implies the o...
متن کاملReals which compute little
We investigate combinatorial lowness properties of sets of natural numbers (reals). The real A is super-low if A′ ≤tt ∅′, and A is jump-traceable if the values of {e}A(e) can be effectively approximated in a sense to be specified. We investigate those properties, in particular showing that super-lowness and jump-traceability coincide within the r.e. sets but none of the properties implies the o...
متن کاملK-trivial Degrees and the Jump-traceability Hierarchy
For every order h such that P n 1/h(n) is finite, every K-trivial degree is h-jump-traceable. This motivated Cholak, Downey and Greenberg [2] to ask whether this traceability property is actually equivalent to K-triviality, thereby giving the hoped for combinatorial characterisation of lowness for Martin-Löf randomness. We show however that the K-trivial degrees are properly contained in those ...
متن کاملStrong Jump-traceability I : the Computably Enumerable Case
Recent investigations in algorithmic randomness have lead to the discovery and analysis of the fundamental class K of reals called the K-trivial reals, defined as those whose initial segment complexity is identical with that of the sequence of all 1’s. There remain many important open questions concerning this class, such as whether there is a combinatorial characterization of the class and whe...
متن کاملSuperhighness
We prove that superhigh sets can be jump traceable, answering a question of Cole and Simpson. On the other hand, we show that such sets cannot be weakly 2-random. We also study the class superhigh 3 , and show that it contains some, but not all, of the noncom-putable K-trivial sets.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Inf. Process. Lett.
دوره 112 شماره
صفحات -
تاریخ انتشار 2012